Subspaces of $L\sp{1}$, via random measures
نویسندگان
چکیده
منابع مشابه
Entanglement in Random Subspaces
The selection of random subspaces plays a role in quantum information theory analogous to the role of random strings in classical information theory. Recent applications have included protocols achieving the quantum channel capacity and methods for extending superdense coding from bits to qubits. In addition, random subspaces have proved useful for studying the structure of bipartite and multip...
متن کاملRandom Fractal Measures via the Contraction Method
In this paper we extend the contraction mapping method to prove various existence and uniqueness properties of (self-similar) random fractal measures, and establish exponential convergence results for approximating sequences defined by means of the scaling operator. For this purpose we introduce a version of the Monge Kantorovich metric on the class of probability distributions of random measur...
متن کاملDiversified Random Forests Using Random Subspaces
Random Forest is an ensemble learning method used for classification and regression. In such an ensemble, multiple classifiers are used where each classifier casts one vote for its predicted class label. Majority voting is then used to determine the class label for unlabelled instances. Since it has been proven empirically that ensembles tend to yield better results when there is a significant ...
متن کاملInformation Measures via Copula Functions
In applications of differential geometry to problems of parametric inference, the notion of divergence is often used to measure the separation between two parametric densities. Among them, in this paper, we will verify measures such as Kullback-Leibler information, J-divergence, Hellinger distance, -Divergence, … and so on. Properties and results related to distance between probability d...
متن کاملMeshes that trap random subspaces
In our recent work [30, 33] we considered solving under-determined systems of linear equations with sparse solutions. In a large dimensional and statistical context we proved results related to performance of a polynomial l1-optimization technique when used for solving such systems. As one of the tools we used a probabilistic result of Gordon [18]. In this paper we revisit this classic result i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1981
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1981-0626483-2